Interpolation and Intersection Algorithms and GPU

نویسنده

  • Vaclav Skala
چکیده

Interpolation and intersection methods are closely related and used in computer graphics, visualization, computer vision etc. The Euclidean representation is used nearly exclusively not only in computational methods, but also in education despite it might lead to instability in computation in many cases. The projective geometry, resp. projective extension of the Euclidean space, offers many positive features from the computational and educational points of view with higher robustness and stability of computation. This paper presents simple examples of projective representation advantages, especially from the educational point of view. In particular, how interpolation and intersection can be applied to fundamental algorithms, which are becoming more robust, stable and faster due to compact formulation. Another advantage of the proposed approach is a simple implementation on vector-vector architectures, e.g. GPU, as it is based on matrixvector operations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)

Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...

متن کامل

Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform

There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...

متن کامل

GPU Ray Tracing - Comparative Study on Ray-Triangle Intersection Algorithms

We present a comparative study of GPU ray tracing implemented for two different types of ray-triangle intersection algorithms used with BVH (Bounding Volume Hierarchy) spatial data structure evaluated for performance on three static scenes. We study how number of triangles placed in a BVH leaf node affects rendering performance. We propose GPUoptimized SIMD ray-triangle intersection method eval...

متن کامل

Fast Ray-Tetrahedron Intersection Using Plucker Coordinates

We present an algorithm for ray–tetrahedron intersection. The algorithm uses Plücker coordinates to represent the ray and the edges of the tetrahedron and employs a robust and efficient test to determine the intersection. The algorithm is highly optimized and provides a significant performance increase over related algorithms.

متن کامل

A Hybrid Parallel Spatial Interpolation Algorithm for Massive LiDAR Point Clouds on Heterogeneous CPU-GPU Systems

Nowadays, heterogeneous CPU-GPU systems have become ubiquitous, but current parallel spatial interpolation (SI) algorithms exploit only one type of processing unit, and thus result in a waste of parallel resources. To address this problem, a hybrid parallel SI algorithm based on a thin plate spline is proposed to integrate both the CPU and GPU to further accelerate the processing of massive LiD...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011